Encoding toroidal triangulations

نویسندگان

  • Vincent Despré
  • Daniel Gonçalves
  • Benjamin Lévêque
چکیده

Poulalhon and Schaeffer introduced an elegant method to linearly encode a planar triangulation optimally. The method is based on performing a special depth-first search algorithm on a particular orientation of the triangulation: the minimal Schnyder wood. Recent progress toward generalizing Schnyder woods to higher genus enables us to generalize this method to the toroidal case. In the plane, the method leads to a bijection between planar triangulations and some particular trees. For the torus we obtain a similar bijection but with particular unicellular maps (maps with only one face).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A bijection for essentially 4-connected toroidal triangulations

Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications (drawing algorithm, random generation, enumeration. . . ). In this paper we introduce and study a generalization of these objects for the toroidal case. Contrary to...

متن کامل

Generalization of Schnyder woods to orientable surfaces and applications

Schnyder woods are particularly elegant combinatorial structures with numerous applications concerning planar triangulations and more generally 3-connected planar maps. We propose a simple generalization of Schnyder woods from the plane to maps on orientable surfaces of any genus with a special emphasis on the toroidal case. We provide a natural partition of the set of Schnyder woods of a given...

متن کامل

K6-minors in triangulations and complete quadrangulations

In this paper, we shall prove that a projective-planar (resp., toroidal) triangulation G has K6 as a minor if and only if G has no quadrangulation isomorphic to K4 (resp., K5) as a subgraph. As a application of the theorems, we can prove that Hadwiger’s conjecture is true for projective-planar and toroidal triangulations.

متن کامل

Grünbaum colorings of toroidal triangulations

We prove that if G is a triangulation of the torus and χ(G) 6= 5, then there is a 3-coloring of the edges of G so that the edges bounding every face are assigned three different colors.

متن کامل

Canonical Ordering for Triangulations on the Cylinder, with Applications to Periodic Straight-Line Drawings

We extend the notion of canonical orderings to cylindric triangulations. This allows us to extend the incremental straight-line drawing algorithm of de Fraysseix, Pach and Pollack to this setting. Our algorithm yields in linear time a crossing-free straight-line drawing of a cylindric triangulation G with n vertices on a regular grid Z/wZ× [0..h], with w ≤ 2n and h ≤ n(2d+1), where d is the (gr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 57  شماره 

صفحات  -

تاریخ انتشار 2017